New Upper Bound and Lower Bound for Degree-Based Network Entropy
نویسندگان
چکیده
منابع مشابه
New Upper Bound and Lower Bound for Degree-Based Network Entropy
The degree-based network entropy which is inspired by Shannon’s entropy concept becomes the information-theoretic quantity for measuring the structural information of graphs and complex networks. In this paper, we study some properties of the degree-based network entropy. Firstly we develop a refinement of Jensen’s inequality. Next we present the new and more accurate upper bound and lower boun...
متن کاملKernelization: New Upper and Lower Bound Techniques
In this survey, we look at kernelization: algorithms that transform in polynomial time an input to a problem to an equivalent input, whose size is bounded by a function of a parameter. Several results of recent research on kernelization are mentioned. This survey looks at some recent results where a general technique shows the existence of kernelization algorithms for large classes of problems,...
متن کاملNew Upper and Lower Bound Sifting Iterations
with fκ(s) as large as possible (resp. Fκ(s) as small as possible) given that the above inequality holds for all choices of A satisfying (1). Selberg [3] has shown (in a much more general context) that the functions fκ(s), Fκ(s) are continuous, monotone, and computable for s > 1, and that they tend to 1 exponentially as s goes to infinity. Let β = β(κ) be the infimum of s such that fκ(s) > 0. S...
متن کاملAn Upper Bound for Uniform Entropy Numbers
Let r > 1 and let Q be a probability measure on a measurable space (X, .4). In this note, we present a proof of a useful bound in Lr ( Q)-norm for the entropy of a convex hull in the case that covering numbers for a class of measurable functions are polynomial.
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2016
ISSN: 2073-8994
DOI: 10.3390/sym8020008